Relating logic programs and attribute grammars
نویسندگان
چکیده
منابع مشابه
Can we transform logic programs into attribute grammars?
In this paper we study the relationship between Attribute Grammars and Logic Programs, concentrating on transforming logic programs into attribute grammars. This has potential applications in compilation techniques for logic programs. It does not seem possible to transform arbitrary Logic Programs into Attribute Grammars, basically because the same logic variables can sometimes be used as input...
متن کاملConstructing Programs as Executable Attribute Grammars
Attribute grammars provide a formal yet intuitive notation for specifying the static semantics of programming languages and consequently have been used in various compiler generation systems. Their use, however, need not be limited to this. With a little change in perspective, many programs may be regarded as interpreters and constructed as executable attribute grammars. The major advantage is ...
متن کاملNP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars
Attribute grammars and logic programs are two well investigated formalisms, which were related in DM85] for the restricted class of simple logic programs. In this paper we deene the more restricted class of very simple logic programs and we prove that the problem of deciding, whether a given logic program is (very) simple, is NP{complete.
متن کاملRelating Disjunctive Logic Programs to Default Theories
This paper presents the relationship between disjunctive logic programs and default theories. We rst show that Bidoit and Froidevaux's positivist default theory causes a problem in the presence of disjunctive information in a program. Then we present a correct transformation of disjunctive logic programs into default theories and show a one-to-one correspondence between the stable models of a p...
متن کاملUsing Attribute Grammars to Derive Eecient Functional Programs
Two mappings from attribute grammars to lazy functional programs are deened. One of these mappings is an eecient implementation of attribute grammars. The other mapping yields ineecient programs. It is shown how some transformations of functional programs may be better understood by viewing the programs as ineecient implementations of attribute grammars.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1985
ISSN: 0743-1066
DOI: 10.1016/0743-1066(85)90015-9